An explicit, coupled-layer construction of a high-rate MSR code with low sub-packetization level, small field size and d < (n - 1)
نویسندگان
چکیده
This paper presents an explicit construction for an ((n = 2qt, k = 2q(t−1), d = n−(q+1)), (α = q(2q)t−1, β = α q )) regenerating code over a field FQ operating at the Minimum Storage Regeneration (MSR) point. The MSR code can be constructed to have rate k/n as close to 1 as desired, sub-packetization level α ≤ r nr for r = (n− k), field size Q no larger than n and where all code symbols can be repaired with the same minimum data download. This is the first-known construction of such an MSR code for d < (n− 1).
منابع مشابه
An Explicit, Coupled-Layer Construction of a High-Rate MSR Code with Low Sub-Packetization Level, Small Field Size and All-Node Repair
This paper presents an explicit construction for an ((n, k, d), (α, β)) regenerating code over a field FQ operating at the Minimum Storage Regeneration (MSR) point. The parameters of the MSR code can be expressed in terms of two auxiliary parameters (q, t), q ≥ 2, t ≥ 2: n = qt, k = q(t−1), d = (n−1), α = q and β = qt−1. The required field size Q is no larger than n. The MSR code can thus be co...
متن کاملExplicit MSR Codes with Optimal Access, Optimal Sub-Packetization and Small Field Size for $d = k+1, k+2, k+3$
This paper presents the construction of an explicit, optimal-access, high-rate MSR code for any (n, k, d = k + 1, k + 2, k + 3) parameters over the finite field FQ having sub-packetization α = qd n q e, where q = d − k + 1 and Q = O(n). The sub-packetization of the current construction meets the lower bound proven in a recent work by Balaji et al. in [1]. To our understanding the codes presente...
متن کامل∊-MSR codes with small sub-packetization
Minimum storage regenerating (MSR) codes form a special class of maximum distance separable (MDS) codes by providing mechanisms for exact regeneration of a single code block in their codewords by downloading the minimum amount of information from the remaining code blocks. As a result, the MSR codes find application to distributed storage systems to enable node repairs with the optimal repair b...
متن کاملLocally Repairable and Locally Regenerating Codes by Parity-Splitting of HashTag Codes
We construct an explicit family of locally repairable and locally regenerating codes whose existence was proven in a recent work by Kamath et al. about codes with local regeneration but no explicit construction was given. This explicit family of codes is based on HashTag codes. HashTag codes are recently defined vector codes with different vector length α (also called a sub-packetization level)...
متن کاملConstructions of High-Rate MSR Codes over Small Fields
Three constructions of minimum storage regenerating (MSR) codes are presented. The first two constructions provide access-optimal MSR codes, with two and three parities, respectively, which attain the sub-packetization bound for access-optimal codes. The third construction provides larger MSR codes with three parities, which are not access-optimal, and do not necessarily attain the sub-packetiz...
متن کامل